Bicriterion scheduling of identical processing time jobs by uniform processors
نویسندگان
چکیده
The problem of bicriterion scheduling of jobs with identical processing times by uniform processors is considered. The first criterion is the minimization of either total or maximum costs, the second one is the minimization of maximum cost with different cost functions. Polynomial time algorithms are presented to determine all efficient solutions and the optimal solution for a given global criterion.
منابع مشابه
An Efficient Bi-objective Genetic Algorithm for the Single Batch-Processing Machine Scheduling Problem with Sequence Dependent Family Setup Time and Non-identical Job Sizes
This paper considers the problem of minimizing make-span and maximum tardiness simultaneously for scheduling jobs under non-identical job sizes, dynamic job arrivals, incompatible job families,and sequence-dependentfamily setup time on the single batch- processor, where split size of jobs is allowed between batches. At first, a new Mixed Integer Linear Programming (MILP) model is proposed for t...
متن کاملNew Formulation and Solution in PCB Assembly Systems with Parallel Batch processors
This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...
متن کاملFast algorithms for preemptive scheduling of equal-length jobs on a single and identical processors to minimize the number of late jobs
We consider the preemptive scheduling of n equal-length jobs with release times and due dates with the objective to minimize the number of late jobs on a single and parallel identical processors. Our algorithm for the single-processor version is on-line and runs in time O(n log n). It produces an optimal schedule. Our multiprocessor algorithm is off-line, it has the time complexity of O(n) and ...
متن کاملLecture 2: Scheduling on Parallel Machines
Parallel environment (alpha in Graham’s notation): • P parallel identical • Q uniform machines: each machine has a given speed speed i, and all jobs have a size sizej, the processing time is given by sizej/speed i • R unrelated machines: the processing time of job j on machine i is given by pi,j, without any other constraints Sometimes the number of processors is fixed: for example, P2, F2, or Pm.
متن کاملBicriterion Single Machine Scheduling with Resource Dependent Processing Times
A bicriterion problem of scheduling jobs on a single machine is studied. The processing time of each job is a linear decreasing function of the amount of a common discrete resource allocated to the job. A solution is specified by a sequence of the jobs and a resource allocation. The quality of a solution is measured by two criteria, F1 and F2. The first criterion is the maximal or total (weight...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & OR
دوره 25 شماره
صفحات -
تاریخ انتشار 1995